Bounded depth broadcasting
نویسندگان
چکیده
منابع مشابه
Broadcasting in Bounded Degree Graphs
Broadcasting is an information dissemination process in which a message is to be sent from a single originator to all members of a network by placing calls over the communication lines of the network. Several previous papers have investigated methods to construct sparse graphs (networks) in which this process can be completed in minimum time from any originator. The graphs produced by these met...
متن کاملBroadcasting on Bounded Degree DAGs
We study the following generalization of the well-known model of broadcasting on trees. Consider an infinite directed acyclic graph (DAG) with a unique source node X . Let the collection of nodes at distance k from X be called the kth layer. At time zero, the source node is given a bit. At time k ≥ 1, each node in the (k − 1)th layer inspects its inputs and sends a bit to its descendants in the...
متن کاملDepth-bounded Discrepancy Search
Many search trees are impractical ly large to explore exhaustively. Recently, techniques like l imi ted discrepancy search have been proposed for improving the chance of f inding a goal in a l imi ted amount of search. Depth-bounded discrepancy search offers such a hope. The motivat ion behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top o...
متن کاملDepth - bounded Discrepancy
Many search trees are impractically large to explore exhaustively. Recently, techniques like limited discrepancy search have been proposed for improving the chance of nding a goal in a limited amount of search. Depth-bounded discrepancy search ooers such a hope. The motivation behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top of the tree...
متن کاملBounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By developing an appropriate automaton model, we show that under this assumption various formalisms, including a two variable first-order logic and a subset of XPath, have decidable emptiness problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00165-a